Breaking RSA Generically Is Equivalent to Factoring
نویسندگان
چکیده
منابع مشابه
Breaking RSA May Be Easier Than Factoring
We provide evidence that breaking low-exponent rsa cannot be equivalent to factoring integers. We show that an algebraic reduction from factoring to breaking low-exponent rsa can be converted into an e cient factoring algorithm. Thus, in e ect an oracle for breaking rsa does not help in factoring integers. Our result suggests an explanation for the lack of progress in proving that breaking rsa ...
متن کاملComputing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring
We address one of the most fundamental problems concerning the RSA cryptoscheme: Does the knowledge of the RSA public key/ secret key pair (e, d) yield the factorization of N = pq in polynomial time? It is well-known that there is a probabilistic polynomial time algorithm that on input (N, e, d) outputs the factors p and q. We present the first deterministic polynomial time algorithm that facto...
متن کاملLower Bounds for Factoring Integral-Generically
An integral-generic factoring algorithm is, loosely speaking, a constant sequence of ring operations that computes an integer whose greatest common divisor with a given integral random variable n, such as an RSA public key, is non-trivial. Formal definitions for generic factoring will be stated. Integral-generic factoring algorithms seem to include versions of trial division and Lenstra’s ellip...
متن کاملBased on RSA and Factoring
Abstract—Non-malleability is an important property in commitment schemes. It can resist to the person-in-the-middle (PIM) attacks within the interaction. In this paper, we focus on the non-malleability in ID-based trapdoor commitments. We first give two constructions of (full) ID-based trapdoor commitment schemes based on RSA and Factoring assumptions respectively and then extend them to non-m...
متن کاملImproved Factoring of RSA Modulus
In 1999, the 512-bit number of 155 digits taken from the RSA Challenge list was first factored by the General Number Field Sieve. This work was done on a supercomputer and about 300 PCs or workstations by 17 experts all over the world. The calendar time for the factorization was over 6 months. Based on the open source GGNFS, we improved its algorithms and implementations. Now the 512-bit RSA mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2016
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2016.2594197